A Fixed-Point Iterative Method for Discrete Tomography Reconstruction Based on Intelligent Optimization

نویسندگان

چکیده

Discrete Tomography (DT) is a technology that uses image projection to reconstruct images. Its reconstruction problem, especially the binary (0–1 matrix) has attracted strong attention. In this study, fixed point iterative method of integer programming based on intelligent optimization proposed optimize reconstructed model. The solution process can be divided into two procedures. First, DT problem reformulated polyhedron judgment lattice basis reduction. Second, fixed-point Dang and Ye used judge whether an exists in previous program. All programs involved study are written MATLAB. final experimental data show obviously better than branch bound terms computational efficiency, case high dimension. requires more operations takes long time. It also needs store large number leaf node boundaries corresponding consumption matrix, which occupies memory space.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Common Fixed Point Theorem Using an Iterative Method

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...

متن کامل

Iterative scheme based on boundary point method for common fixed‎ ‎point of strongly nonexpansive sequences

Let $C$ be a nonempty closed convex subset of a real Hilbert space $H$. Let ${S_n}$ and ${T_n}$ be sequences of nonexpansive self-mappings of $C$, where one of them is a strongly nonexpansive sequence. K. Aoyama and Y. Kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)S_n(alpha_nu+(1-alpha_n)T_nx_n)$ for finding the common fixed point of ${S_n}$ and ${T_n}$, where $uin C$ is ...

متن کامل

An Iterative Scheme for Generalized Equilibrium, Variational Inequality and Fixed Point Problems Based on the Extragradient Method

The problem ofgeneralized equilibrium problem is very general in the different subjects .Optimization problems, variational inequalities, Nash equilibrium problem and minimax problems are as special cases of generalized equilibrium problem. The purpose of this paper is to investigate the problem of approximating a common element of the set of generalized equilibrium problem, variational inequal...

متن کامل

AIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems

The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...

متن کامل

iterative scheme based on boundary point method for common fixed‎ ‎point of strongly nonexpansive sequences

let $c$ be a nonempty closed convex subset of a real hilbert space $h$. let ${s_n}$ and ${t_n}$ be sequences of nonexpansive self-mappings of $c$, where one of them is a strongly nonexpansive sequence. k. aoyama and y. kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)s_n(alpha_nu+(1-alpha_n)t_nx_n)$ for finding the common fixed point of ${s_n}$ and ${t_n}$, where $uin c$ is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cmes-computer Modeling in Engineering & Sciences

سال: 2023

ISSN: ['1526-1492', '1526-1506']

DOI: https://doi.org/10.32604/cmes.2022.020656